Constructing Minimum Connected Dominating Set in Mobile Ad Hoc Networks
نویسندگان
چکیده
One of the most important challenges of a Mobile Ad Hoc Network (MANET) is to ensure efficient routing among its nodes. A Connected Dominating Set (CDS) is a widely used concept by many protocols for broadcasting and routing in MANETs. Those existing protocols require significant message overhead in construction of CDS. In this paper, we propose a simple, inexpensive and novel algorithm of computing a minimum CDS. The proposed algorithm saves time and message overhead in forming a CDS while supporting node mobility efficiently. Simulation results show that the proposed algorithm is efficient in terms of both message complexity and the size of the CDS.
منابع مشابه
Virtual backbone construction in multihop ad hoc wireless networks
Recent research points out that the flooding mechanism for topology update or route request in existing ad hoc routing protocols greatly degrades the network capacity. If we restrict the broadcast of control packets within a small subset of hosts in the network, the protocol overhead can be substantially reduced. This motivates our research of constructing a virtual backbone by computing a conn...
متن کاملClustering wireless ad hoc networks with weakly connected dominating set
The increasing popular personal communications and mobile computing require a wireless network infrastructure that supports selfconfiguration and self-management. Efficient clustering protocol for constructing virtual backbone is becoming one of the most important issues in wireless ad hoc networks. The weakly connected dominating set (WCDS) is very suitable for cluster formation. As finding th...
متن کاملA New Heuristic for the Minimum Connected Dominating Set Problem on Ad Hoc Wireless Networks
Given a graph G = (V, E), a dominating set D is a subset of V such that any vertex not in D is adjacent to at least one vertex in D. Efficient algorithms for computing the minimum connected dominating set (MCDS) are essential for solving many practical problems, such as finding a minimum size backbone in ad hoc networks. Wireless ad hoc networks appear in a wide variety of applications, includi...
متن کاملMaintaining weakly-connected dominating sets for clustering ad hoc networks
An ad hoc network is a multihop wireless communication network supporting mobile users. Network performance degradation is a major problem as the network becomes larger. Clustering is an approach to simplify the network structure and thus alleviate the scalability problem. One method that has been proposed to form clusters is to use weaklyconnected dominating sets [Y.P. Chen, A.L. Liestman, App...
متن کاملAlgorithmic, geometric and graphs issues in wireless networks
We present an overview of the recent progress of applying computational geometry techniques to solve some questions, such as topology construction and broadcasting, in wireless ad hoc networks. Treating each wireless device as a node in a two dimensional plane, we model the wireless networks by unit disk graphs in which two nodes are connected if their Euclidean distance is no more than one. We...
متن کامل